Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
نویسندگان
چکیده
منابع مشابه
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
We briefly survey several existing methods for solving polynomial system with inexact coefficients, then introduce our new symbolic-numeric method which is based on the geometric (Jet) theory of partial differential equations. The method is stable and robust. Numerical experiments illustrate the performance of the new method.
متن کاملDetermining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
We present a method based on symbolic-numeric reduction to geometric involutive form to compute the primary component and a basis of Max Noether space of a polynomial system at an isolated singular solution. The singular solution can be known exactly or approximately. If the singular solution is known with limited accuracy, then we propose a generalized quadratic Newton iteration to refine it t...
متن کاملSolving Nonlinear Polynomial Systems via Symbolic-Numeric Elimination Method
Consider a general polynomial system S in x1, . . . , xn of degree q and its corresponding vector of monomials of degree less than or equal to q. The system can be written as M0 · [xq1, xq−1 1 x2, . . . , xn, x1, . . . , xn, 1] = [0, 0, . . . , 0, 0, . . . , 0, 0] (1) in terms of its coefficient matrix M0. Here and hereafter, [...] T means the transposition. Further, [ξ1, ξ2, . . . , ξn] is one...
متن کاملOn Symbolic-Numeric Solving of Sine-Polynomial Equations
This paper deals with the localization of all the real roots of sine-polynomials. D. Richardson (1991, in ``effective Methods in Algebraic Geometry,'' pp. 427 440, Birkha user, Basel) has already studied this type of analytic function. He showed how to find the number of real roots in a bounded interval. Here we propose an algorithm which determines whether a sine-polynomial has a finite number...
متن کاملSymbolic-numeric methods for solving polynomial equations and applications
This tutorial gives an introductive presentation of algebraic and geometric methods for solving a polynomial system f1 = · · · = fm = 0. The first class of methods is based on the study of the quotient algebra A of the polynomial ring modulo the ideal I = (f1, . . . , fm). We show how to deduce the geometry of the solutions, from the structure of A and in particular, how solving polynomial equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.10.013